Architecture Design and Evaluation of Ldpc Decoder on Tta Based Codesign Environment

نویسندگان

  • Sudeep Kanur
  • Chandra Shekar
  • Johan Lilius
  • Sebastien Lafond
چکیده

High quality digital video transmission requires efficient and reliable data communication over broadcasting channels as there is a risk of data corruption associated during transmission. The near channel performance of Low Density Parity Check Codes (LDPC) has motivated its use in second generation Digital Video Broadcasting (DVB) standards for mobile, cable, satellite and terrestrial channels as an error correction code. But iterative decoding of LDPC codes provides significant implementation challenges as the complexity grows with the code size. This problem can be mitigated by exploiting the modular nature of the iterative decoding scheme for efficient parallel implementation. Transport Triggered Architecture (TTA) provides a processor template that exploits operation style parallelism and parallelism at data transport level. TTA-Based Codesign Environment (TCE) provides the necessary toolset to design a TTA processor. In addition, the toolset also provides the means to design application specific processors to accelerate the execution of the application and implement the processor on reconfigurable logic platform such as Field Programmable Gate Arrays (FPGAs) with ease. This work leverages TCE toolset to implement iterative decoding scheme such as reduced minimum sum algorithm on field programmable gate arrays. It also presents the throughput gains and evaluates the capabilities of the TTA architecture and the TCE toolset for the design of application specific instruction set processors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design Methodology for Offloading Software Executions to FPGA

Field programmable gate array (FPGA) is a flexible solution for offloading part of the computations from a processor. In particular, it can be used to accelerate an execution of a computationally heavy part of the software application, e.g., in DSP, where small kernels are repeated often. Since an application code for a processor is a software, a design methodology is needed to convert the code...

متن کامل

A Novel Architecture for Scalable, High throughput, Multi-standard LDPC Decoder

This paper presents a a novel bottom up parallel approach for implementing high throughput , scalable multistandard, layered LDPC decoding architecture. Proposed solution includes three elements of novelty i.e. 1) A parallel Min Sum check node based on ”Tree way” approach 2) Channel Memory organization scheme at block level to support parallel access for proposed check node 3) Flexibility in te...

متن کامل

Design of a Quasi-Cyclic LDPC Decoder Using Generic Data Packing Scheme

-This paper proposed a generic data packing scheme for quasi-cyclic LDPC codes decoder which has two advantages. Firstly, in this scheme no shift network is needed, it greatly reduces the area of the LDPC decoder. Secondly, in this scheme, all the messages in a row can be accessed from memories in one cycle, it increase the throughput of LDPC decoder. A LDPC decoder architecture using the data ...

متن کامل

Design and Synthesis of Binary Ldpc Decoder

This paper is aimed to optimize the binary LDPC decoder which has been shown to outperform commonly used codes for many communications and storage channels. Currently proposed binary LDPC decoder architectures have very high rates close to the channel capacity for the large code word length, in this research work we had presented a decoding algorithm based on belief propagation and provide deta...

متن کامل

Efficient VLSI Architectures for Error-Correcting Coding A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY

This thesis is devoted to several efficient VLSI architecture design issues in errorcorrecting coding, including finite field arithmetic, (Generalized) Low-Density ParityCheck (LDPC) codes, and Reed-Solomon codes. A systematic low-complexity bit-parallel finite field multiplier design approach is proposed. This design approach is applicable to GF (2m) constructed by arbitrary irreducible polyno...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013